Poisson Group Testing: A Probabilistic Model for Boolean Compressed Sensing
نویسندگان
چکیده
منابع مشابه
Poisson Compressed Sensing
Compressed sensing has profound implications for the design of new imaging and network systems, particularly when physical and economic limitations require that these systems be as small and inexpensive as possible. However, several aspects of compressed sensing theory are inapplicable to real-world systems in which noise is signal-dependent and unbounded. In this work we discuss some of the ke...
متن کاملMinimax risk for Poisson compressed sensing
This paper describes performance bounds for compressed sensing in the presence of Poisson noise and shows that, for sparse or compressible signals, they are within a log factor of known lower bounds on the risk. The signal-independent and bounded noise models used in the literature to analyze the performance of compressed sensing do not accurately model the effects of Poisson noise. However, Po...
متن کاملCompressed Sensing, Group Testing and Matrix Completion in a Nutshell
Compressed sensing of sparse signals is a field that has become pervasive over the last decade, with interesting and strong theoretical guarantees, as well as practical applications across fields. The group testing problem arose several decades earlier in the context of blood testing for syphilis where very few patients had the disease and it was too expensive to test everyone independently. Ma...
متن کاملMAT 585: Johnson-Lindenstrauss, Group testing, and Compressed Sensing
Suppose one has n points, X = {x1, . . . , xn}, in Rd (with d very large). If d > n, since the points have to lie in a subspace of dimension n it is clear that one can consider the projection f : Rd → Rn of the points to that subspace without distorting the geometry of X. In particular, for every xi and xj , ‖f(xi)− f(xj)‖ = ‖xi − xj‖, meaning that f is an isometry in X. Suppose now we allow a ...
متن کاملExact Rule Learning via Boolean Compressed Sensing
We propose an interpretable rule-based classification system based on ideas from Boolean compressed sensing. We represent the problem of learning individual conjunctive clauses or individual disjunctive clauses as a Boolean group testing problem, and apply a novel linear programming relaxation to find solutions. We derive results for exact rule recovery which parallel the conditions for exact r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2015
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2015.2446433